One kind of character sum modulo a prime p and its recurrence formula
نویسندگان
چکیده
منابع مشابه
Binomial Character Sums modulo Prime Powers
We show that the binomial and related multiplicative character sums p ∑ x=1 (x,p)=1 χ(x(Ax +B)), p ∑ x=1 χ1(x)χ2(Ax k +B), have a simple evaluation for large enough m (for m ≥ 2 if p ABk).
متن کاملLinear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملOn sum-free sets modulo p
Let p be a sufficiently large prime and A be a sum-free subset of Z/pZ; improving on a previous result of V. F. Lev, we show that if |A| = card(A) > 0.324p, then A is contained in a dilation of the interval [|A| , p− |A|] (mod. p).
متن کاملOrders Modulo A Prime
In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...
متن کاملAlmost Prime Orders of CM Elliptic Curves Modulo p
Let E/Q be an elliptic curve over the rationals and, for any prime p, let us denote by |E(Fp)| the number of Fp points of the reduced curve modulo p. Consider the function ΠE,s(x) = #{p ≤ x : |E(Fp)| = Ps}, where Ps denotes a squarefree number with at most s prime divisors. In particular P1 denotes a prime number. In 1988 Koblitz, motivated by criptographic applications, (see [1]), conjectured ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Difference Equations
سال: 2019
ISSN: 1687-1847
DOI: 10.1186/s13662-019-2073-9